Feasibility Intervals for the Deadline Driven Scheduler with Arbitrary Deadlines
نویسندگان
چکیده
In this paper, we extend the determination of feasibility intervals to task sets with arbitrary deadlines, both in the synchronous and the asynchronous case. Meanwhile we also improve the arguments and results generally found in the literature.
منابع مشابه
Analysis of Deadline Scheduled Real-Time Systems
A uniform, exible approach is proposed for analysing the feasibility of deadline scheduled real-time systems. In its most general formulation, the analysis assumes sporadically periodic tasks with arbitrary deadlines, release jitter, and shared resources. System overheads of a tick driven scheduler implementation, and scheduling of soft aperiodic tasks are also accounted for. A procedure for th...
متن کاملPressGeneral Response Time Computation for the DeadlineDriven Scheduling of Periodic Tasks
In this paper we study the problem of scheduling hard real-time periodic task sets with a dynamic and preemptive scheduler. We will focus on the response time notion, its interest and its eeective computation for the deadline driven scheduler. We present a general calculation procedure for determining the response time of the k th request of a task in asynchronous systems with general as well a...
متن کاملSHRED: a CPU Scheduler for Heterogeneous Applications
General purpose workstations must support a wide variety of application characteristics; but it is hard to find a single CPU scheduling scheme that satisfactorily schedules processes from all types of applications. It is particularly difficult to get periodic deadline-driven continuous media processes to satisfactorily coexist with others. A number of schemes have been proposed to address this ...
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملOptimal Priority Assignment for Aperiodic Tasks with Firm Deadlines in Fixed Priority Pre-Emptive Systems
An optimal priority assignment policy is presented for independent aperiodic tasks with arbitrary ready times and firm deadlines, scheduled on a uniprocessor along with a set of hard periodic/sporadic tasks. The latter tasks are assumed to have been assigned unique fixed priorities according to some arbitrary policy and guaranteed, via off-line feasibility analysis, to meet their deadlines. In ...
متن کامل